Complex boolean networks obtained by diagonalization
نویسندگان
چکیده
منابع مشابه
Dynamics of complex autonomous Boolean networks
Springer-Verlag Gmbh Feb 2015, 2015. Buch. Book Condition: Neu. 244x161x20 mm. Neuware This thesis focuses on the dynamics of autonomous Boolean networks, on the basis of Boolean logic functions in continuous time without external clocking. These networks are realized with integrated circuits on an electronic chip as a field programmable gate array (FPGA) with roughly 100,000 logic gates, offer...
متن کاملAsynchronous Simulation of Boolean Networks by Monotone Boolean Networks
We prove that the fully asynchronous dynamics of a Boolean network f : {0, 1} → {0, 1} without negative loop can be simulated, in a very specific way, by a monotone Boolean network with 2n components. We then use this result to prove that, for every even n, there exists a monotone Boolean network f : {0, 1} → {0, 1}, an initial configuration x and a fixed point y of f such that: (i) y can be re...
متن کاملPhoneme classification by boolean networks
The most popular neural network models for use in speech recognition experiments are employ model neurons which apply a nonlinear function to a weighted sum of their inputs. These networks are trained by adjusting the weights in the weighted sums. There is another class of models called Boolean networks, in which the model neurons output logical functions of their inputs. The training process a...
متن کاملLearning by Probabilistic Boolean Networks
Boolean networks, in spite of their structural simplicity, seem to be able to simulate the dynamics of complex biological and non-biological systems. Learning algorithms in neural networks have shown to be a very promising approach to some problems connected to artificial intelligence. Positive feedback has been successfully used by the genetic algorithm and the ant system. In this paper we pro...
متن کاملRoutines for the diagonalization of complex matrices
This note describes a set of routines for the eigenvalue decomposition, singular value decomposition, and Takagi factorization of a complex matrix. Unlike many other implementations, the current ones are all based on the Jacobi algorithm, which makes the code very compact but suitable only for small to medium-sized problems. Although distributed as a library, the routines are self-contained and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1985
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90036-2